The inverse strong non-split r-domination number of a graph
نویسندگان
چکیده
منابع مشابه
Strong non split r-domination number of a graph
In this paper, we define the notions of inverse strong non-split r-dominating set and inverse strong non-split r-domination number γ′snsr(G) of a graph G. We characterize graphs for which γsnsr(G) + γ′snsr(G) = n, where γsnsr(G) is the strong non-split r-domination number of G. We get many bounds on γ′snsr(G). Nordhaus-Gaddum type results are also obtained for this new parameter.
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملStrong Non-Split Domination in Directed Graphs
The concept of connectedness plays an important role in many networks. Digraphs are considered as an excellent modeling tool and are used to model many types of relations amongst any physical situations. In this paper the concept of strong non-split domination in directed graph D has been introduced by considering the dominating set S is a strong non-split dominating set if the complement of S ...
متن کاملOn the r-domination number of a graph
The (classical) domination number of a graph is the cardinality of a smallest subset of its vertex set with the property that each vertex of the graph is in the subset or adjacent to a vertex in the subset. Since its introduction to the literature during the early 1960s, this graph parameter has been researched extensively and nds application in the generic facility location problem where a sma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering, Science and Technology
سال: 2010
ISSN: 2141-2839,2141-2820
DOI: 10.4314/ijest.v2i1.59102